Resultaten visas 1 - 10 / 130
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År

Uniformly convex-transitive function spaces

Rambla-Barreno, Fernando; Talponen, Jarno
-2009

Almost Standards levynjulkaisukonsertti

Vartiainen, Varre; Pyysalo, Severi; Hirvonen, Timo; Lehtonen, Jussi
-2022

A new transitive signature scheme

Referentgranskad
DOI
10.1007/978-3-319-46298-1_11
Lin, Chao; Zhu, Fei; Wu, Wei; Liang, Kaitai; Choo, Kim Kwang Raymond
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...2016

Transitive closure algorithm MEMTC and its performance analysis

Referentgranskad
Hirvisalo, V.; Nuutila, E.; Soisalon-Soininen, E.
Discrete Applied Mathematics2001

Transitive closure algorithm DISC_TC and its performance analysis

Hirvisalo, V.; Nuutila, E.; Soisalon-Soininen, E.
-1996

Algorithms for finding maximum transitive subtournaments

Referentgranskad
DOI
10.1007/s10878-014-9788-z
Kiviluoto, Lasse; Östergård, Patric R J; Vaskelainen, Vesa P.
Journal of Combinatorial Optimization2016

An experimental study on transitive closure representations

Nuutila, E.
-1996

Constructing error-correcting binary codes using transitive permutation groups

Referentgranskad
DOI
10.1016/j.dam.2017.08.022
Laaksonen, Antti; Östergård, Patric R.J.
Discrete Applied Mathematics2017

Chain Transitive Homeomorphisms on a Space: All or None

Referentgranskad
Öppen tillgång
DOI
10.2140/pjm.2017.291.1
Akin, Ethan; Rautio, Juho
Pacific journal of mathematics2017

An Efficient Transitive Closure Algorithm for Cyclic Digraphs

Referentgranskad
Nuutila, E.
Information Processing Letters1994

Uniformly convex-transitive function spaces

2009

Almost Standards levynjulkaisukonsertti

2022

A new transitive signature scheme

Referentgranskad
DOI
10.1007/978-3-319-46298-1_11
2016

Transitive closure algorithm MEMTC and its performance analysis

Referentgranskad
2001

Transitive closure algorithm DISC_TC and its performance analysis

1996

Algorithms for finding maximum transitive subtournaments

Referentgranskad
DOI
10.1007/s10878-014-9788-z
2016

An experimental study on transitive closure representations

1996

Constructing error-correcting binary codes using transitive permutation groups

Referentgranskad
DOI
10.1016/j.dam.2017.08.022
2017

Chain Transitive Homeomorphisms on a Space: All or None

Referentgranskad
Öppen tillgång
DOI
10.2140/pjm.2017.291.1
2017

An Efficient Transitive Closure Algorithm for Cyclic Digraphs

Referentgranskad
1994